Graph theory - PDFSEARCH.IO - Document Search Engine

Graph theory
Results: 6735

#	Item
331	Decision Tree Complexity, Solvable Groups, and the Distribution of Prime Numbers Joint Work 2010 L´ Add to Reading List Source URL: files.vipulnaik.com Language: English - Date: 2016-08-13 11:33:29 Graph theory Mathematics Discrete mathematics AanderaaKarpRosenberg conjecture Planar graph Graph property Graph Logic of graphs Triangle-free graph
332	PATHS, TREES, AND FLOWERS JACK E D M O N D S 1. Introduction. A graph G for purposes here is a finite set of elements called vertices and a finite set of elements called edges such that each edge meets exactly two vertic Add to Reading List Source URL: www.cs.mun.ca Language: English - Date: 2015-03-23 10:06:06 Graph theory Mathematics Matching Graph Bipartite graph Vertex cover Tree Ear decomposition Blossom algorithm Graph coloring
333	Network Analysis and Modeling, CSCI 5352 LectureProf. Aaron Clauset Add to Reading List Source URL: tuvalu.santafe.edu Language: English - Date: 2013-11-23 11:09:18 Graph theory Mathematics Discrete mathematics Network theory Algebraic graph theory Networks Network analysis Clustering coefficient Centrality Giant component Vertex Connectivity
334	Exploring Trade-Offs in Buffer Requirements and Throughput Constraints for Synchronous Dataflow Graphs Sander Stuijk, Marc Geilen, Twan Basten Add to Reading List Source URL: www.es.ele.tue.nl Language: English - Date: 2005-10-31 13:15:23 Graph theory Network performance Throughput Topological graph theory Cycle Connectivity
335	The giant component in a random subgraph of a given graph Fan Chung1 ? , Paul Horn1 , and Linyuan Lu2 1 ?? Add to Reading List Source URL: web.cs.du.edu Language: English - Date: 2010-11-16 11:14:05 Graph theory Mathematics Algebraic graph theory Matrices Adjacency matrix Regular graph Graph coloring NP-complete problems Two-graph Expander graph
336	Spectral Graph Theory Lecture 4 Courant-Fischer and Graph Coloring Daniel A. Spielman Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2012-08-24 09:50:05 Algebra Mathematics Graph theory Linear algebra Algebraic graph theory Matrix theory Graph coloring Matrices Eigenvalues and eigenvectors Regular graph Adjacency matrix Rayleigh quotient
337	Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems Karl Bringmann1 , Christian Engels2 , Bodo Manthey3 , B. V. Raghavendra Rao4 1 Max Planck Institute for Informatics, .d Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:46:12 Graph theory Mathematics Computational complexity theory NP-complete problems Combinatorial optimization NP-hard problems Approximation algorithms Edsger W. Dijkstra Travelling salesman problem Nearest neighbour algorithm Shortest path problem Maximal independent set
338	Spectral Graph Theory Lecture 4 Bounding Eigenvalues Daniel A. Spielman Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2015-09-22 14:35:18 Graph theory Expander graph Graph coloring Chromatic polynomial Two-graph
339	Page Migration with Limited Local Memory Capacity Susanne Albers? Hisashi Koga?? Add to Reading List Source URL: www14.in.tum.de Language: English - Date: 2013-11-25 11:07:00 Computational complexity theory Mathematics Graph theory Analysis of algorithms Online algorithms Edsger W. Dijkstra Network theory Probabilistic complexity theory Randomized algorithm Algorithm Distributed computing Shortest path problem
340	Exact and Efficient Generation of Geometric Random Variates and Random Graphs Karl Bringmann1 and Tobias Friedrich2 1 Max-Planck-Institut f¨ Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:45:52 Mathematics Computational complexity theory Graph theory Analysis of algorithms NP-complete problems Probabilistic complexity theory Combinatorics Randomized algorithm Rejection sampling NP Independent set Poisson distribution

UPDATE